Reconstruction of Group Multiplication Tables by Quadrangle Criterion
نویسندگان
چکیده
منابع مشابه
Reconstruction of Group Multiplication Tables by Quadrangle Criterion
For n > 3, every n×n partial Cayley matrix with at most n−1 holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result. Reconstruction of other types of multiplication tables is discussed.
متن کاملOn minimum distances and the quadrangle criterion
We give a new proof of the theorem of Joszéf Dénes: If L1 and L2 are distinct latin squares of order n ≥ 2, n / ∈ {4, 6}, that satisfy the quadrangle criterion, then L1 and L2 differ in at least 2n entries.
متن کاملClosest Multiplication Tables of Groups
Suppose that all groups of order n are defined on the same set G of cardinality n, and let the distance of two groups of order n be the number of pairs (a, b) ∈ G×G where the two group operations differ. Given a group G(◦) of order n, we find all groups of order n, up to isomorphism, that are closest to G(◦).
متن کاملTIGER: Querying Large Tables through Criterion Extension
Sales on the Internet have increased significantly during the last decade, and so, it is crucial for companies to retain customers on their web site. Among all strategies towards this goal, providing customers with a flexible search tool is a crucial issue. In this paper, we propose an approach, called TIGER, for handling such flexibility automatically. More precisely, if the search criteria of...
متن کاملDeciding Associativity for Partial Multiplication Tables of Order 3 *
The associativity problem for the class of finite multiplication tables is known to be undecidable, even for quite narrow infinite subclasses of tables. We present criteria which can be used to decide associativity in many cases, although any effective method based on such criteria must eventually fail on a table of some size (as otherwise decidability for the general class would follow). By me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2001
ISSN: 0195-6698
DOI: 10.1006/eujc.2001.0548